A new conception for computing gröbner basis and its applications
نویسنده
چکیده
This paper presents a conception for computing gröbner basis. We convert some of gröbner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm’s finite termination problem can be described by equivalent conditions, so all the above algorithms can be determined when they terminate finitely. At last, a new criterion is presented. It is an improvement for the Rewritten and Signature Criterion.
منابع مشابه
A new algorithm for computing SAGBI bases up to an arbitrary degree
We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.
متن کاملAn efficient method for computing comprehensive Gröbner bases
a r t i c l e i n f o a b s t r a c t A new approach is proposed for computing a comprehensive Gröb-ner basis of a parameterized polynomial system. The key new idea is not to simplify a polynomial under various specialization of its parameters, but rather keep track in the polynomial, of the power products whose coefficients vanish; this is achieved by partitioning the polynomial into two parts...
متن کاملSignature-Based Gröbner Basis Algorithms - Extended MMM Algorithm for computing Gröbner bases
Signature-based algorithms is a popular kind of algorithms for computing Gröbner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-based algorithms is given, that is, signature-based algorithms can be regarded as an extended version of the famous MMM algorithm. By this view,...
متن کاملOne-sided Noncommutative Gröbner Bases with Applications to Computing Green's Relations *
Standard noncommutative Gröbner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gröbner basis procedures for one-sided ideals in finitely presented noncommutative algebras over fields. The polynomials defining a K-algebra A as a quotient of a free K-algebra are combined with the polynomials defining a one-sided ideal I of ...
متن کاملA New Algorithm for Discussing Gröbner Bases with Parameters
In many practical applications it is necessary to determine a Gröbner basis of an ideal of polynomials whose coefficients depend on some parameters. The main problem in this context is to obtain the distinct reduced Gröbner basis for all possible values of the parameters. Examples of this situation can be found, for instance, in constructive algebraic geometry when determining conditions for a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1012.5425 شماره
صفحات -
تاریخ انتشار 2010